Surface-to-surface intersection based on triangular parameter domain subdivision 100

An improved algorithm for the computation of the intersection curve of two general parametric surfaces is presented. The introduced subdivision algorithm follows a divide-and-conquer-approach. For each pair of patches, it rst checks if the corresponding bounding volumes intersect. If they intersect, then it tries to nd dispensable parts of one patch (and the corresponding parts in the parameter domain) which can be cut o . Next it splits the reduced patch by splitting its parameter domain into triangular pieces and treats all new pairs of patches recursively until a prede ned termination condition is satis ed. To take full advantage of the cut-o operation patches with triangular domains bounded by so-called \Tripipeds" are used.